A criterion for flatness in minimal area metrics that define string diagrams
نویسندگان
چکیده
منابع مشابه
Minimal Area Nonorientable String Diagrams
We use minimal area metrics to generate all nonorientable string diagrams. The surfaces in unoriented string theory have nontrivial open curves and nontrivial closed curves whose neighborhoods are either annuli or Möbius strips. We define a minimal area problem by imposing length conditions on open curves and on annular closed curves only. We verify that the minimal area conditions are respecte...
متن کاملA Local Flatness Criterion for Complete Modules
We prove various extensions of the Local Flatness Criterion over a Noetherian local ring R with residue field k. For instance, if Ω is a complete R-module of finite projective dimension, then Ω is flat if and only if Torn (Ω, k) = 0 for all n = 1, . . . , depth(R). In low dimensions, we have the following criteria. If R is onedimensional and reduced, then Ω is flat if and only if Tor1 (Ω, k) = ...
متن کاملFlatness Is a Criterion for Selection of Maximizing Measures
For a full shift with Np+ 1 symbols and for a non-positive potential, locally proportional to the distance to one of N disjoint full shifts with p symbols, we prove that the equilibrium state converges as the temperature goes to 0. The main result is that the limit is a convex combination of the two ergodic measures with maximal entropy among maximizing measures and whose supports are the two s...
متن کاملA First-order Logic for String Diagrams
Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax called !-box notation. While this does greatly increase the proving power of string diagrams, previous attempts to go beyond equational reasoning have been l...
متن کاملLayout Metrics for Euler Diagrams
An alternative term for these diagrams is “Euler-Venn diagrams” but they are often inaccurately called “Venn diagrams”. Venn diagrams often look similar, but must contain all possible intersections of contours. In contrast, Euler diagrams contain any desired combination of intersections between the contours. Visualizations of Venn diagrams are often created by taking advantage of the symmetries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 1992
ISSN: 0010-3616,1432-0916
DOI: 10.1007/bf02097012